package com.cn.codebrush.链表;

/**
 * @Author Boolean
 * @Date 2022/5/20 22:41
 * @Version 1.0
 */
public class No141环形链表 {


    public boolean hasCycle(ListNode head) {
        ListNode slow = head;
        ListNode fast = head;

        while(fast != null && fast.next != null){
            slow = slow.next;
            fast = fast.next.next;
            if(slow == fast){
                return true;
            }
        }
        return false;
    }
}
